A condition for arcs and MDS codes
نویسنده
چکیده
A set of n + k points (k > 0) in projective space of dimension n is said to be an (n + k)-arc if there is no hyperplane containing any n + 1 points of the set. It is well-known that for the projective space PG(n, q), this is equivalent to a maximum distance separable linear code with symbols in the finite field GF(q), of length n + k, dimension n + 1, and distance d = k that satisfies the Singleton bound d ≤ k. We give an algebraic condition for such a code, or set of points, and this is associated with an identity involving determinants.
منابع مشابه
Cyclic arcs and pseudo-cyclic MDS codes
Cyclic arcs (defined by Storme and Van Maldghem, [1994]) and pseudocyclic MDS codes are equivalent objects. We survey known results on the existence of cyclic arcs. Some new results on cyclic arcs in PG(2, q) are also given.
متن کاملMaximum distance separable codes and arcs in projective spaces
Given any linear code C over a finite field GF(q) we show how C can be described in a transparent and geometrical way by using the associated Bruen–Silverman code. Then, specializing to the case of MDS codes we use our new approach to offer improvements to the main results currently available concerning MDS extensions of linear MDS codes. We also sharply limit the possibilities for constructing...
متن کاملA Non-MDS Erasure Code Scheme for Storage Applications
This paper investigates the use of redundancy and self repairing against node failures indistributed storage systems using a novel non-MDS erasure code. In replication method, accessto one replication node is adequate to reconstruct a lost node, while in MDS erasure codedsystems which are optimal in terms of redundancy-reliability tradeoff, a single node failure isrepaired after recovering the ...
متن کاملConstructions of Optical Orthogonal Codes from Finite Geometry
The link between finite geometry and various classes of error-correcting codes is well known. Arcs in projective spaces, for instance, have a close tie to linear MDS codes as well as the high-performing low-density parity-check codes. In this article, we demonstrate a connection between arcs and optical orthogonal codes (OOCs), a class of non-linear binary codes used for many modern communicati...
متن کاملThe number of points on a curve , and applications Arcs and curves : the legacy of Beniamino Segre
Curves defined over a finite field have various applications, such as (a) the construction of good error-correcting codes, (b) the correspondence with arcs in a finite Desarguesian plane, (c) the Main Conjecture for maximum-distance-separable (MDS) codes. Bounds for the number of points of such a curve imply results in these cases. For plane curves, there is a variety of bounds that can be cons...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Des. Codes Cryptography
دوره 58 شماره
صفحات -
تاریخ انتشار 2011